On the Resource Bounded Measure of P/poly
نویسندگان
چکیده
We show that the class of sets having polynomial size circuits, P=poly, has EXPNP-measure zero under each of the following two assumptions: EXPNP 6= ZPP p2 (which holds if the polynomial time hierarchy does not collapse to ZPP p2 ), or NP is not small (does not have EXP-measure zero).
منابع مشابه
Relative to a Random Oracle, P/Poly is not Measurable in EXP
It is shown that, with respect to a random oracle, EXP \ P=poly and EXP ? P=poly do not have resource-bounded measure zero in EXP:
متن کاملPseudorandom Generators, Measure Theory, and Natural Proofs
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in terms of the resource-bounded measure theory of Lutz. We prove our result by showing that if P/poly has measure zero in exponential time, then there is a natural proof against P/poly, in the terminology of Razborov an...
متن کاملPseudorandom Generators, Measure Theory, and Natural Proofs - Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on
We prove that i f strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (Plpoly) is not measurable within exponential time, in terms of the resource-bounded measure theory of Lutz. We prove our result by showing that i f P/poly has measure zero in exponential time, then there is a natural proof against Plpoly, in the terminology of Razborov ...
متن کاملTwo Results on Resource-Bounded Measure
We construct an oracle relative to which NP has p-measure 0 but D p has measure 1 in EXP. This gives a strong relativized negative answer to a question posed by Lutz Lut96]. Secondly, we give strong evidence that BPP is small. We show that BPP has p-measure 0 unless EXP = MA and the polynomial-time hierarchy collapses. This contrasts the work of Regan et al. RSC95], where it is shown that P=pol...
متن کامل2 00 4 A note on dimensions of polynomial size circuits ∗
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i ≥ 0, P/poly has ith order scaled p 3 -strong dimension 0. We also show that P/poly i.o. has p 3 -dimension 1/2, p 3 -strong dimension 1. Our results improve previous measure results of Lutz (1992) and dimension results of Hitchcock and Vinodchandran (2004).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998